- computable sequence
- Математика: вычислимая последовательность
Универсальный англо-русский словарь. Академик.ру. 2011.
computable sequence
Смотреть что такое "computable sequence" в других словарях:
Computable number — In mathematics, particularly theoretical computer science and mathematical logic, the computable numbers, also known as the recursive numbers or the computable reals, are the real numbers that can be computed to within any desired precision by a… … Wikipedia
Computable real function — In mathematical logic, specifically computability theory, a function is sequentially computable if, for every computable sequence of real numbers, the sequence is also computable. A function is effectively uniformly continuous if there exists a… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Computable analysis — In mathematics, computable analysis is the study of which parts of real analysis and functional analysis can be carried out in a computable manner. It is closely related to constructive analysis. Basic results The computable real numbers form a… … Wikipedia
Integer sequence — In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula for its nth term, or implicitly by giving a relationship between its terms. For example,… … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
Mayer–Vietoris sequence — In mathematics, particularly algebraic topology and homology theory, the Mayer–Vietoris sequence is an algebraic tool to help compute algebraic invariants of topological spaces, known as their homology and cohomology groups. The result is due to… … Wikipedia
Adams spectral sequence — In mathematics, the Adams spectral sequence is a spectral sequence introduced by Adams (1958). Like all spectral sequences, it is a computational tool; it relates homology theory to what is now called stable homotopy theory. It is a… … Wikipedia
ICES Intertemporal Computable Equilibrium System — affects regional and world economies. The model has been developed at the Climate Change Modelling and Policy Research Programme of the Fondazione Eni Enrico Mattei – FEEM, a research institution in the field of sustainable development.… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Computation in the limit — In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit and limit recursive are also used. One can think of limit computable functions as … Wikipedia
